Properties of four partial orders on standard Young tableaux

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Properties of four partial orders on standard Young tableaux

Let SY Tn be the set of all standard Young tableaux with n cells. After recalling the definitions of four partial orders, the weak, KL, geometric and chain orders on SY Tn and some of their crucial properties, we prove three main results: • Intervals in any of these four orders essentially describe the product in a Hopf algebra of tableaux defined by Poirier and Reutenauer. • The map sending a ...

متن کامل

Hopf Structures on Standard Young Tableaux

We review the Poirier-Reutenauer Hopf structure on Standard Young Tableaux and show that it is a distinguished member of a family of Hopf structures. The family in question is related to deformed parastatistics. In this paper K is a field of characteristic zero and all vector spaces are over K. A K[S]-module is a collection of K[Sr]-modules of the symmetric groups Sr. A H(q)-module is a collect...

متن کامل

On Descents in Standard Young Tableaux

In this paper, explicit formulae for the expectation and the variance of descent functions on random standard Young tableaux are presented. Using these, it is shown that the normalized variance, V/E2, is bounded if and only if a certain inequality relating tableau shape to the descent function holds.

متن کامل

Enumeration of Semi { Standard Young Tableaux

Standard tableaux. A Young tableau (also known as a standard tableau) is an arrangement of distinct integers in an array of left justiied rows, such that the entries of each row are in increasing order from left to right and the entries of each column are in increasing order from bottom to top 2. For instance, here is an array of size 15: 11 4 8 12 14 3 6 7 13 1 2 5 9 10 15 : In general a table...

متن کامل

Involutions on Standard Young Tableaux and Divisors on Metric Graphs

We elaborate upon a bijection discovered by Cools, Draisma, Payne, and Robeva in [CDPR12] between the set of rectangular standard Young tableaux and the set of equivalence classes of chip configurations on certain metric graphs under the relation of linear equivalence. We present an explicit formula for computing the v0-reduced divisors (representatives of the equivalence classes) associated to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 2006

ISSN: 0097-3165

DOI: 10.1016/j.jcta.2005.09.008